In formal language theory, a class of languages mathcal L has finite thickness if for every string s, there are only finitely many consistent languages in mathcal L. This condition was introduced by Dana Angluin in connection with learning, as a sufficient condition for language identification in the limit.
详细百科解释